Compressing Bi-Level Images by Block Matching on a Tree Architecture
نویسنده
چکیده
A work-optimal O(log M log n) time parallel implementation of lossless image compression by block matching of bi-level images is shown on a full binary tree architecture under some realistic assumptions, where n is the size of the image and M is the maximum size of the match. Decompression on this architecture is also possible with the same parallel computational complexity. Such implementations have no scalability isuues.
منابع مشابه
Measurement of Left Ventricular Myocardium Wall Instantaneous Motions with Echocardiographic Sequence Images
Background & Aims: One of the important aims of quantitative cardiac image processing is the clarification of myocardial motions in order to derive biomechanical behavior of the heart in the disease condition. In this study we presented a computerized analysis method for detecting the instantaneous myocardial changes by using 2D echocardiography images. Methods: The analysis was performed on th...
متن کاملSpeeding up Lossless Image Compression: Experimental Results on a Parallel Machine
Arithmetic encoders enable the best compressors both for bi-level images (JBIG) and for grey scale and color images (CALIC), but they are often ruled out because too complex. The compression gap between simpler techniques and state of the art compressors can be significant. Storer extended dictionary text compression to bi-level images to avoid arithmetic encoders (BLOCK MATCHING), achieving 70...
متن کاملA Fuzzy Condition Sensitive Hierarchical Algorithm for Template Matching in Emotionally Expressive Facial Images
The paper aims at developing a hierarchical algorithm for matching a given template of × on an image of × pixels partitioned into equal sized blocks of × pixels. The algorithm employs a fuzzy metric to measure the dispersion of individual feature of a block with respect to that of the template. A fuzzy threshold, preset by the user, is employed to restrict less likely blocks from participation ...
متن کاملDictionary design for text image compression with JBIG2
The JBIG2 standard for lossy and lossless bi-level image coding is a very flexible encoding strategy based on pattern matching techniques. This paper addresses the problem of compressing text images with JBIG2. For text image compression, JBIG2 allows two encoding strategies: SPM and PM&S. We compare in detail the lossless and lossy coding performance using the SPM-based and PM&S-based JBIG2, i...
متن کاملCompressing Stereo Images Using a Reference Image and the Exhaustive Block Matching Algorithm to Estimate Disparity between the Two Images
One method to compress a pair of stereo images is to compress the first image independently and then compress the second image by estimating the disparity between the two images. The first image was transformed using 2-D Discrete Cosine Transform, quantized using the JPEG quantization matrix and finally encoded into a bitstream using arithmetic encoding. The disparity between the two images was...
متن کامل